Small diameters and generators for arithmetic lattices in $$\textrm{SL}_2(\mathbb {R})$$ and certain Ramanujan graphs
نویسندگان
چکیده
We show that arithmetic lattices in $\mathrm{SL}_{2}(\mathbb{R})$, stemming from the proper units of an Eichler order indefinite quaternion algebra over $\mathbb{Q}$, admit a `small' covering set. In particular, we give bounds on diameter if quotient space is co-compact. Consequently, these small generators. Our techniques also apply to definite algebras where Ramanujan-strength certain Ramanujan graphs without use bound.
منابع مشابه
Nonexistence of certain cubic graphs with small diameters
Jorgensen, L.K., Nonexistence of certain cubic graphs with small diameters, Discrete Mathematics 114 (1993) 2655273. We consider the maximum number of vertices in a cubic graph with small diameter. We show that a cubic graph of diameter 4 has at most 40 vertices. (The Moore bound is 46 and graphs with 38 vertices are known.) We also consider bipartite cubic graphs of diameter 5, for which the M...
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملRamanujan Graphs with Small Girth
We construct an infinite family of (q + 1)−regular Ramanujan graphs Xn of girth 1. We also give covering maps Xn+1 → Xn such that the minimal common covering of all the Xn’s is the universal covering tree.
متن کاملpassivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
Hamilton Paths in Certain Arithmetic Graphs
For each integer m ≥ 1, consider the graph Gm whose vertex set is the set N = {0, 1, 2, . . . } of natural numbers and whose edges are the pairs xy with y = x + m or y = x − m or y = mx or y = x/m. Our aim in this note is to show that, for each m, the graph Gm contains a Hamilton path. This answers a question of Lichiardopol. For each integer m ≥ 1, consider the graph Gm whose vertex set is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ramanujan Journal
سال: 2023
ISSN: ['1572-9303', '1382-4090']
DOI: https://doi.org/10.1007/s11139-023-00725-1